#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;

LL T;
LL f[N], g[N];

LL qpow(LL a, LL b, LL p)
{
	LL ans = 1;
	while(b)
	{
		if(b & 1) ans = ans * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return ans;
}

void init(LL p)
{
	int n = p - 1;
	f[0] = 1;
	for(int i = 1;i <= n;i ++) f[i] = f[i - 1] * i % p;
	g[n] = qpow(f[n], p - 2, p);
	for(int i = n - 1;i >= 0;i --) g[i] = g[i + 1] * (i + 1) % p;
}

LL c(LL n, LL m, LL p)
{
	if(n < m) return 0;
	return (f[n] * g[m] % p) * g[n - m] % p;
}

LL lucas(LL n, LL m, LL p)
{
	if(m == 0) return 1;
	return (lucas(n / p, m / p, p) * c(n % p, m % p, p)) % p;
}

int main()
{
	cin >> T;
	while(T --)
	{
		LL n, m, p; cin >> n >> m >> p;
		init(p);
		cout << lucas(n + m, m, p) << endl;
	}
	return 0;
}